Congruences Defined by Languages and Filters
نویسنده
چکیده
The usual right congruence :"L can be generalized in the following manner: x ~£: ,LY :¢> {z t xz e L ~:~yz eL} ~,LP, where ~9 ° is a family of languages. It turns out to be useful when £# is a falter with an additional property. Furthermore semifilters are introduced and studied. It is also possible to define congruences by filters. Assuming the (right) congruences to have finite index yields a generalization of the regular sets.
منابع مشابه
T-FUZZY CONGRUENCES AND T-FUZZY FILTERS OF A BL-ALGEBRA
In this note, we introduce the concept of a fuzzy filter of a BLalgebra,with respect to a t-norm briefly, T-fuzzy filters, and give some relatedresults. In particular, we prove Representation Theorem in BL-algebras. Thenwe generalize the notion of a fuzzy congruence (in a BL-algebra) was definedby Lianzhen et al. to a new fuzzy congruence, specially with respect to a tnorm.We prove that there i...
متن کاملMyhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملExpansions of Heyting algebras
It is well-known that congruences on a Heyting algebra are in one-to-one correspondence with filters of the underlying lattice. If an algebra A has a Heyting algebra reduct, it is of natural interest to characterise which filters correspond to congruences on A. Such a characterisation was given by Hasimoto [1]. When the filters can be sufficiently described by a single unary term, many useful p...
متن کاملLogical and Algebraic Characterizations of Rational Transductions
Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free automata, star-free expressions, aperiodic (finite) congruences, or first-order (FO) logic. In particular, their algebraic characterization by aperiodic con...
متن کاملK-catenation and applications: k-prefix codes.dvi
Some generalizations of the usual operations of catenation and quotient of languages are introduced and studied. In particular, language equations involving these operations are considered. Infinite hierarchies of classes of prefix codes and classes of equivalence relations are defined and investigated in connection respectively with the classical notions of prefix codes and right syntactic con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Information and Control
دوره 44 شماره
صفحات -
تاریخ انتشار 1980